Approximation Theory
نویسنده
چکیده
Approximation theory is an area of mathematics that has become indispensable to the computational sciences. The approximation of magnitudes and functions describing some physical behavior is an integral part of scientific computing, queueing problems, neural networks, graphics, robotics, network traffic, financial trading, antenna design, floating-point arithmetic, image processing, speech analysis, and video signal filtering, to name just a few areas. The idea of seeking a simple mathematical function that describes some behavior approximately has two sources of motivation. The exact behavior that one is studying may not be able to be expressed in a closed mathematical formula. But even if an exact description is available it may be far too complicated for practical use. In both cases a best and simple approximation is required. What is meant by best and simple depends on the application at hand. The approximation is often used in a computer implementation, and therefore its evaluation needs to be efficient. The simplest and fastest functions for implementation are polynomials, because they use only the fast hardware operations of addition and multiplication. Next come rational functions, which also need the hardware operation division, one or more depending on their representation as a quotient of polynomials or as a continued fraction. Rational functions offer the clear advantage that they can reproduce asymptotic behavior (vertical, horizontal, slant), which is something polynomials are incapable of doing. For periodic phenomena, linear combinations of trigonometric functions make good candidates. For growth models or decaying magnitudes, linear combinations of exponentials can be used. In approximation theory one distinguishes between interpolation and so-called least-squares problems. In the former one wants the approximate model to take exactly the same values as prescribed by data given at precise argument values. In the latter a set of data (not necessarily discrete) is regarded as a trend and approximated by a simple model in one or other best sense. The difference is formalized in the following sections. Besides constructing a good and efficient mathematical model, one should also take the following two issues into account.
منابع مشابه
Topological structure on generalized approximation space related to n-arry relation
Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...
متن کاملCalculation of the Induced Charge Distribution on the Surface of a Metallic Nanoparticle Due to an Oscillating Dipole Using Discrete Dipole Approximation method
In this paper, the interaction between an oscillating dipole moment and a Silver nanoparticle has been studied. Our calculations are based on Mie scattering theory and discrete dipole approximation(DDA) method.At first, the resonance frequency due to excitingthe localized surface plasmons has been obtained using Mie scattering theory and then by exciting a dipole moment in theclose proximity of...
متن کاملS-APPROXIMATION SPACES: A FUZZY APPROACH
In this paper, we study the concept of S-approximation spaces in fuzzy set theory and investigate its properties. Along introducing three pairs of lower and upper approximation operators for fuzzy S-approximation spaces, their properties under different assumptions, e.g. monotonicity and weak complement compatibility are studied. By employing two thresholds for minimum acceptance accuracy and m...
متن کاملA Note on Belief Structures and S-approximation Spaces
We study relations between evidence theory and S-approximation spaces. Both theories have their roots in the analysis of Dempsterchr('39')s multivalued mappings and lower and upper probabilities, and have close relations to rough sets. We show that an S-approximation space, satisfying a monotonicity condition, can induce a natural belief structure which is a fundamental block in evidence theory...
متن کاملHomotopy approximation of modules
Deleanu, Frei, and Hilton have developed the notion of generalized Adams completion in a categorical context. In this paper, we have obtained the Postnikov-like approximation of a module, with the help of a suitable set of morphisms.
متن کاملTheoretical Study of Polyethylene Crystallization Using Modified Weighted Density Approximation (MWDA)
In this article, the crystallization of polyethylene is investigated by the modified weighted density approximation. Also, a direct correlation function of polyethylene based on the RISM theory is used. The free energy of a polyethylene is calculated using the density functional theory. The crystallization and also the solid and liquid densities of polyethylene are calculated and compared...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008